A geometric look at corner cutting
نویسندگان
چکیده
G. de Rham (1947), Un peu de math ematiques a propos d'une courbe plane, Elemente der Mathematik, 2(4):89{104. G. de Rham (1956), Sur une courbe plane, Journal de Math ematiques pures et appliqu ees, 35:25{42. 27 Figure 28: Each point in the shaded area carries a continuum of lines such that the associated aane standard cut produces C 1-curves without line segments. Hence for each contact point (line) one can nd a continuum of contact lines (points) such that either the associated projective or aane standard cutting procedure produces a C 1-curve without line segments. Remark 13.2 Dual to Remark 10.2 one has that the aane standard cut produces parabolas if it lies on the parabola through a and b with tangents ac and bc. Addendum After writing the paper we became aware of unpublished notes by Bernd Mulansky with similar ideas as in the proof of Theorem 6.1. 26 Since A 0 and A 1 map lines onto lines, they also describe maps on {. These are the inverse dual maps B 0 = (A 0) ?1 and B 1 = (A 1) ?1 which map the ideal line onto itself and the lines (^ = points of {) ca, ab, bc onto da, ag, de and de, gb, be, respectively. Thus the envelope of the standard curve is obtained by successive applications of B 0 and B 1 to ca and bc. In other words, the polar scheme is given by the standard triangle ca, ab, bc in { , the contact line g and the contact point de while the ideal line of { assumes the role of m. Next we use the coordinates of Section 12 and the polarity with respect to the circle around m through a and b. Then the ideal line and the lines ca, ab, bc are mapped onto the points m, a, c, b. Further, the points on the cubic given in Remark 12.1 correspond to the tangents of the curve " x(t) y(t) # = 1 (t 2 ? t + 1) 2 " (1 ? t) 3 (1 + t) t 3 (2 ? t) # ; while the points in the interior of the shaded area shown in Figure 24 correspond to cuts which do not intersect this curve. This is illustrated in Figure 27: If the aane standard cut intersects the standard triangle only in the shaded …
منابع مشابه
Corner cutting systems
If we can evaluate a curve by means of a corner cutting algorithm, we call the corresponding system of functions a corner cutting system. We prove that corner cutting systems are always monotonicity preserving. We obtain weak sufficient conditions for corner cutting systems. Optimal stability properties and properties concerning the supports of the basis functions of corner cutting systems are ...
متن کاملOn the degree elevation of B-spline curves and corner cutting
In this paper we prove that the degree elevation of B-spline curves can be interpreted as corner cutting process in theory. We also discover the geometric meaning of the auxiliary control points during the corner cutting. Our main idea is to gradually elevate the degree of B-spline curves one knot interval by one knot interval. To this end, a new class of basis functions, to be called bi-degree...
متن کاملCorner Polyhedra and Maximal Lattice-free Convex Sets : A Geometric Approach to Cutting Plane Theory
Corner Polyhedra were introduced by Gomory in the early 60s and were studied by Gomory and Johnson. The importance of the corner polyhedron is underscored by the fact that almost all “generic” cutting planes, both in the theoretical literature as well as ones used in practice, are valid for the corner polyhedron. So the corner polyhedron can be viewed as a unifying structure from which many of ...
متن کاملLocal corner cutting and the smoothness of the limiting curve
Stimulated by recent work by Gregory and Qu, it is shown that the limit of local corner cutting is a continuously differentiable curve in case the corners of the iterates become increasingly flat.
متن کاملCorner cutting with trapezoidal augmentation for area-preserving smoothing of polygons and polylines
Recently, a new subdivision method was introduced by the author for smoothing polygons and polylines while preserving the enclosed area [Gordon D. Corner cutting and augmentation: an area-preserving method for smoothing polygons and polylines. Computer Aided Geometric Design 2010; 27(7):551–62]. The new technique, called ‘‘corner cutting and augmentation’’ (CCA), operates by cutting cornerswith...
متن کاملCorner cutting and augmentation: An area-preserving method for smoothing polygons and polylines
Article history: Received 15 November 2009 Received in revised form 28 March 2010 Accepted 22 May 2010 Available online 27 May 2010
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Aided Geometric Design
دوره 14 شماره
صفحات -
تاریخ انتشار 1997